CDMTCS Research Report Series Hausdorff Measure and Łukasiewicz Languages

Cdmtcs Research Report Series the Hausdorr Measure of Regular !-languages Is Computable 1

CDMTCS Research Report Series Automata with Equational Constraints

We introduce the concept of finite automata with algebraic constraints. We show that the languages accepted by these automata are closed under the Boolean operations. We give efficient polynomial-time algorithms for some decision problems related to these automata and their languages, including sufficient conditions for when we can determinize automata in polynomial time.

Cdmtcs Research Report Series Tracing Lazy Functional Languages Tracing Lazy Functional Languages

We argue that Ariola and Felleisen's and Maraist, Odersky and Wadler's axiomatization of the call-by-need lambda calculus forms a suitable formal basis for tracing evaluation in lazy functional languages. In particular, it allows a one-dimensional textual representation of terms, rather than requiring a two-dimensional graphical representation using arrows. We describe a program LetTrace, imple...

CDMTCS Research Report Series Scott Families and Computably Categorical Structures

CDMTCS Research Report Series Some Thoughts On Automatic Structures